Mixed Integer Programming Model for Pricing in Telecommunication
نویسندگان
چکیده
Yield management has been successfully applied in the context of airline companies. However, so far, application to telecommunication industry have been scarce. Using Yield management principles, this paper investigates the new problem of maximizing revenue of telecommunications operator by setting prices on voice services. This pricing is based on available resource i.e. network load. We first propose a Mixed Integer Program to model this problem. Then we study the particular case where demand and load are linear functions of price. Using numerical results, we also study the impact of a Big M constant on computational effort required to solve the problem.
منابع مشابه
A Two Stage Stochastic Programming Model of the Price Decision Problem in the Dual-channel Closed-loop Supply Chain
In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...
متن کاملIntegrated model for pricing, delivery time setting, and scheduling in make-to-order environments
Usually, in make-to-order environments which work only in response to the customer’s orders, manufacturers for maximizing the profits should offer the best price and delivery time for an order considering the existing capacity and the customer’s sensitivity to both the factors. In this paper, an integrated approach for pricing, delivery time setting and scheduling of new arrival orders are prop...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT
Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...
متن کامل